Deduction for Natural Language Access to Data
نویسندگان
چکیده
1 Department of Linguistics, Stanford University Stanford, California, U.S.A. [email protected] 2 Institute for Natural Language Processing, University of Stuttgart Stuttgart, Germany [email protected] 3 Office of the CTO, SAP Labs Palo Alto, California, U.S.A. [email protected] †now at Infosys 4 Artificial Intelligence Center, SRI International Menlo Park, California, U.S.A [email protected]
منابع مشابه
A Deductive Database Language Supporting Modules
The applicability of programming languages for knowledge based systems to real life application problems is largely determined by their support of modularity, abstraction, and reusability of modules. While the deductive database approach to knowledge representation has its merits in the declarativity of the underlying logic languages and the integration of deduction and efficient database acces...
متن کاملA semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials
We present a variant of the Datalog language (we call it Datalog ), which is able to deal with weights on ground facts. The weights are chosen from a semiring algebraic structure. Our goal is to use this language as a semantic foundation for trust-management languages, in order to express trust relationships associated with a preference (e.g., a cost, an uncertainty, a trust or a fuzzy value). ...
متن کاملStrategy-Enhanced Interactive Proving and Arithmetic Simplification for PVS
We describe an approach to strategy-based proving for improved interactive deduction in specialized domains. An experimental package of strategies (tactics) and support functions called Manip has been developed for PVS to reduce the tedium of arithmetic manipulation. Included are strategies aimed at algebraic simplification of real-valued expressions. A general deduction architecture is describ...
متن کاملThe SQAP Data Base For Natural Language Information
The Swedish Question Answering Pro j ect (SQAP) aims at handli~g many digferent kinds of facts, and nat only facts in a small dpecial application area. The SQAP data base consists of a network of nodes correspdnding to objects, properties, and events in the real.world. Deduction can be performed, and deduction rules can be input i n natural language and stored in the data base. This report desc...
متن کاملTemporalizing Ontology-Based Data Access
Ontology-based data access (OBDA) generalizes query answering in databases towards deduction since (i) the fact base is not assumed to contain complete knowledge (i.e., there is no closed world assumption), and (ii) the interpretation of the predicates occurring in the queries is constrained by axioms of an ontology. OBDA has been investigated in detail for the case where the ontology is expres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014